Learning Top-Down Tree Transducers with Regular Domain Inspection
نویسندگان
چکیده
We study the problem of how to learn tree transformations on a given regular tree domain from a finite sample of input-output examples. We assume that the target tree transformation can be defined by a deterministic top-down tree transducer with regular domain inspection (DTopIreg). An rpni style learning algorithm that solves this problem in polynomial time and with polynomially many examples was presented at Pods’2010, but restricted to the case of path-closed regular domains. In this paper, we show that this restriction can be removed. For this, we present a new normal form for DTopIreg by extending the Myhill-Nerode theorem for DTop to regular domain inspections in a nontrivial manner. The rpni style learning algorithm can also be lifted but becomes more involved too.
منابع مشابه
Normalization and Learning of Transducers on Trees and Words. (Normalisation et Apprentissage de Transducteurs d'Arbres et de Mots)
Since the arrival of the Web, various kinds of semi-structured data formats were introduced in the areas of computer science and technology relevant for the Web, such as document processing, database management, knowledge representation, and information exchange. The most recent technologies for processing semi-structured data rely on the formats Json and Rdf. The main questions there are how t...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملCompositions of Extended Top-down Tree Transducers
Unfortunately, the class of transformations computed by linear extended top-down tree transducers with regular look-ahead is not closed under composition. It is shown that the class of transformations computed by certain linear bimorphisms coincides with the previously mentioned class. Moreover, it is demonstrated that every linear epsilon-free extended top-down tree transducer with regular loo...
متن کاملThe Translation Power of Top-Down Tree-to-Graph Transducers
We introduce a new syntax-directed translation device called top-down tree-to-graph transducer. Such transducers are very similar to the usual (total deterministic) top-down tree transducers except that the right-hand sides of their rules are hypergraphs rather than trees. Since we are aiming at a device which also allows us to translate trees into objects different from graphs, we focus our at...
متن کاملGraph Grammars and Tree Transducers
Regular tree grammars can be used to generate graphs, by generating expressions that denote graphs. Top-down and bottom-up tree transducers are a tool for proving properties of such graph generating tree grammars.
متن کامل